An induction proof of the Ahlswede-Zhang identity
نویسندگان
چکیده
منابع مشابه
development and implementation of an optimized control strategy for induction machine in an electric vehicle
in the area of automotive engineering there is a tendency to more electrification of power train. in this work control of an induction machine for the application of electric vehicle is investigated. through the changing operating point of the machine, adapting the rotor magnetization current seems to be useful to increase the machines efficiency. in the literature there are many approaches wh...
15 صفحه اولA simple proof of the Ahlswede - Csiszár one-bit theorem
1983 931 from the second, let K = AA'. Then AA' is nonnegative definite and IAl*=+4'I < jy&L4'),i = n(l&z:.). (1) i j The implication of the second inequality from the first follows from the fact that every nonnegative definite matrix K can be factored as K = AA'. A typical proof of Hadamard's inequality is by induction (see, for example, Bellman [l]) and involves a determinant decomposition fo...
متن کاملthe crisis of identity in jhumpa lahiris fiction: interpreter of maladies and the namesake
شکل گیری هویت(identity) مقوله مهمی در ادبیات پراکنده مردم(diasporan literature) می باشد. آثار جومپا لاهیری(jhumpa lahiri) ، نویسنده هندی آمریکایی، در سالهای اخیر تحسین منتقدین را به خود معطوف کرده است. وی در این آثار زندگی مهاجران و تلاش آنان برای پیدا کردن جایگاهشان در یک فرهنگ بیگانه را به تصویر کشیده است. این تجربه همواره با احساساتی نظیر دلتنگی برای گذشته، بیگانگی و دوری همراه است. با این ح...
15 صفحه اولAn Alternative Proof for the MacWilliams Identity
This paper provides an alternative proof to the MacWilliams identity for linear block codes over GF(q). The intermediate results of our alternative proof offer some insights of the vector-space structure. Our vector-space-based methodology can be used to establish the relation between weight distributions of dual codes for other metrics.
متن کاملCombinatorial Proof of an Abel-type Identity
Identity (1) below resulted from our investigation in [21] of chip-firing games on complete graphs K n , for n ≥ 1; see, e.g., [2] for antecedents. The left side expresses the sum of the probabilities of a game experiencing firing sequences of each possible length ℓ = 0, 1,. .. , n. This note gives a combinatorial proof that these probabilities sum to unity. We first manipulate n − 1 n + 1 + n ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 1993
ISSN: 0097-3165
DOI: 10.1016/0097-3165(93)90080-r